Application of CUDA in the Boolean Domain for the Unate Covering Problem
نویسندگان
چکیده
NVIDIA’s Compute Unified Device Architecture (CUDA) is a relatively-recent development that allows to realize very fast algorithms for several Constraint Satisfaction and Computer Aided Design tasks. In this paper we present an approach to use Graphics Processing Units (GPU) and CUDA for solving Unate Covering Problem, a practical problem related to SAT. In particular we present a CUDA-enabled Petrick Function Minimizer. We compare the performance of a pipeline-processor (CPU) and a parallel processor (GPU) implementation of the matrix-multiplication method for solving unate covering problems.
منابع مشابه
Parallel Solution of Covering Problems Super-Linear Speedup on a Small Set of Cores
This paper aims at better possibilities to solve problems of exponential complexity. Our special focus is the combination of the computational power of four cores of a standard PC with better approaches in the application domain. As the main example we selected the unate covering problem which must be solved, among others, in the process of circuit synthesis and for graph-covering (domination) ...
متن کاملParallel Solution of Covering Problems Better Models and Algorithms
This paper aims at better possibilities to solve problems with exponential complexity. Our special focus is on the combination of using four cores of a standard PC together with better models in the application domain. As example we selected the unate covering problem, which must be solved, among others, in the process of circuit synthesis and for graph covering (domination) problems. We introd...
متن کاملOn Solving Binate Covering Problems
Binate (or unate) covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of binate covering problem solvers. We show that these techniques reduce by up to three orders of magnitude the time required to...
متن کاملImproving Satisfiability Algorithms with Dominance and Partitioning
In this paper we describe how several search pruning concepts, commonly used in algorithms for solving covering problems, can be incorporated in algorithms for propositional satisfiability (SAT). In particular, we show that the concepts of row dominance and matrix partitioning, commonly used for solving unate and binate covering problems, can be naturally applied to SAT algorithms. Experimental...
متن کاملMPI- and CUDA- implementations of modal finite difference method for P-SV wave propagation modeling
Among different discretization approaches, Finite Difference Method (FDM) is widely used for acoustic and elastic full-wave form modeling. An inevitable deficit of the technique, however, is its sever requirement to computational resources. A promising solution is parallelization, where the problem is broken into several segments, and the calculations are distributed over different processors. ...
متن کامل